Combining Local Consistency, Symbolic Rewriting and Interval Methods
نویسندگان
چکیده
This paper is an attempt to address the processing of nonlinear numerical constraints over the Reals by combining three different methods: local consistency techniques, symbolic rewriting and interval methods. To formalize this combination, we define a generic two-step constraint processing technique based on an extension of the Constraint Satisfaction Problem, called Extended Constraint Satisfaction Problem (ECSP). The first step is a rewriting step, in which the initial ECSP is symbolically transformed. The second step, called approximation step, is based on a local consistency notion, called weak arc-consistency, defined over ECSPs in terms of fixed point of contractant monotone operators. This notion is shown to generalize previous local consistency concepts defined over finite domains (arc-consistency) or infinite subsets of the Reals (arc B-consistency and interval, hull and box-consistency). A filtering algorithm, derived from AC-3, is given and is shown to be correct, confluent and to terminate. This framework is illustrated by the combination of Gröbner Bases computations and Interval Newton methods. The computation of Gröbner Bases for subsets of the initial set of constraints is used as a rewriting step and operators based on Interval Newton methods are used together with enumeration techniques to achieve weak arc-consistency on the modified ECSP. Experimental results from a prototype are presented, as well as comparisons with other systems.
منابع مشابه
Combining Local Consistency ,
This paper is an attempt to address the processing of non-linear numerical constraints over the Reals by combining three diierent methods: local consistency techniques, symbolic rewriting and interval methods. To formalize this combination, we deene a generic two-step constraint processing technique based on an extension of the Constraint Satisfaction Problem, called Extended Constraint Satisfa...
متن کاملAn Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems
متن کامل
An interval algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems ∗
The idea of Componentwise Newton Operator has been presented in [9]. It seems up to now not much attention has been paid to this concept. In this paper we present properties of the Componentwise Newton Operator and show how they can be used in numerical algorithms. It seems they are especially important when transforming the problem by some symbolic methods, based on the computation of Groebner...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملConflict Detection for Edits on Extended Feature Models using Symbolic Graph Transformation
Feature models are used to specify variability of user-configurable systems as appearing, e.g., in software product lines. Software product lines are supposed to be long-living and, therefore, have to continuously evolve over time to meet ever-changing requirements. Evolution imposes changes to feature models in terms of edit operations. Ensuring consistency of concurrent edits requires appropr...
متن کامل